A NEW THREE-TERM CONJUGATE GRADIENT-BASED PROJECTION METHOD FOR SOLVING LARGE-SCALE NONLINEAR MONOTONE EQUATIONS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations

Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...

متن کامل

A new Levenberg-Marquardt approach based on Conjugate gradient structure for solving absolute value equations

In this paper, we present a new approach for solving absolute value equation (AVE) whichuse Levenberg-Marquardt method with conjugate subgradient structure. In conjugate subgradientmethods the new direction obtain by combining steepest descent direction and the previous di-rection which may not lead to good numerical results. Therefore, we replace the steepest descentdir...

متن کامل

Conjugate gradient predictor corrector method for solving large scale problems

In this paper, we give a new method for solving large scale problems. The basic idea of this method depends on implementing the conjugate gradient as a corrector into a continuation method. We use the Euler method as a predictor. Adaptive steplength control is used during the tracing of the solution curve. We present some of our experimental examples to demonstrate the efficiency of the method.

متن کامل

Global conjugate gradient method for solving large general Sylvester matrix equation

In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and  $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$  is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...

متن کامل

An Adaptive Prediction-Correction Method for Solving Large-Scale Nonlinear Systems of Monotone Equations with Applications

and Applied Analysis 3 Lemma 3. Let {x k } and {z k } be any sequence generated by Algorithm 1. Suppose that g is monotone and that the solution set of (1) is not empty, then {x k } and {z k } are both bounded. Furthermore, it holds that lim k→∞ 󵄩󵄩󵄩󵄩xk − zk 󵄩󵄩󵄩󵄩 = 0, (13) lim k→∞ 󵄩󵄩󵄩󵄩xk+1 − xk 󵄩󵄩󵄩󵄩 = 0. (14) Proof. From (6), we have ⟨g (z k ) , x k − z k ⟩ = −α k ⟨g (z k ) , d k ⟩ ≥ σα 2 k 󵄩󵄩󵄩󵄩...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Modelling and Analysis

سال: 2019

ISSN: 1392-6292,1648-3510

DOI: 10.3846/mma.2019.033